#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
      LL n;cin>>n;
      LL y=1;
      for(y=1;y*(y-1)<=2*n;y++){
         if((y+1)*y>2*n){
             break;
         }
      }
      cout<<"1";
      LL cnt=n-y*(y-1)/2;
      cout<<"33";
      for(LL i=1;i<=cnt;i++){
          cout<<"7";
      }
      y-=2;
      for(LL i=1;i<=y;i++) cout<<"3";
      cout<<"7";
      cout<<"\n";
   }
   return 0;
}
